A Thesis Proposal on Final Coalgebras

نویسندگان

  • Jeremy Avigad
  • Steve Awodey
  • Dana Scott
چکیده

I present an overview of nal coalgebras together with a description of initial algebras, showing the analogies between the two. In particular , I show how initiality of algebras leads to the properties of deenition by recursion and proof by induction. I then show how nal coalgebras have the analogous properties of deenition by corecursion and proof by coinduction, motivating the latter by Peter Aczel's anti-foundation set theory. I present two of the current existence theorems for nal coal-gebras (the rst due to Michael Barr and the second to Peter Aczel and Nax Mendler). Finally, I present a list of some open questions/research projects that I intend to study for my dissertation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

بررسی نظرات دانشجویان پزشکی زاهدان در مورد تاثیر درس بهداشت4 و اتاق مشاوره بر پایان‌نامه آنان

Objectives : The course "Health IV" and "consulting room" are two resources of learning about the method of preparing proposal and passing the final thesis for medical students at Zahedan University of Medical Sciences (ZUMS). The purpose of this study was to investigate the students' viewpoints on the effects of "Health IV" and consulting room on their final theses (pl. of thesis). Methods : T...

متن کامل

Computable Functions on Final Coalgebras

This paper tackles computability issues on final coalgebras and tries to shed light on the following two questions: First, which functions on final coalgebras are computable? Second, which formal system allows us to define all computable functions on final coalgebras? In particular, we give a definition of computability on final coalgebras, deriving from the theory of effective domains. We then...

متن کامل

CIA Structures and the Semantics of Recursion

Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS processes form final coalgebras. We present a uniform account of the semantics of recursive definitions in final coalgebras by combining two ideas: (1) final coalgebras are also initial completely iterative algebras ...

متن کامل

Of the Hennessy-Milner Property and other Demons

We relate three different, but equivalent, ways to characterise behavioural equivalence for set coalgebras. These are: using final coalgebras, using coalgebraic languages that have the HennessyMilner property and using coalgebraic languages that have “logical congruences”. On the technical side the main result of our paper is a straightforward construction of the final T -coalgebra of a set fun...

متن کامل

On descent for coalgebras and type transformations

We find a criterion for a morphism of coalgebras over a Barr-exact category to be effective descent and determine (effective) descent morphisms for coalgebras over toposes in some cases. Also, we study some exactness properties of endofunctors of arbitrary categories in connection with natural transformations between them as well as those of functors that these transformations induce between co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998